Iterative Computation of the Fréchet Derivative of the Polar Decomposition
نویسندگان
چکیده
We derive iterative methods for computing the Fréchet derivative of the map which sends a full-rank matrix A to the factor U in its polar decomposition A = UH, where U has orthonormal columns and H is Hermitian positive definite. The methods apply to square matrices as well as rectangular matrices having more rows than columns. Our derivation relies on a novel identity that relates the Fréchet derivative of the polar decomposition to the matrix sign function sign(X) = X(X2)−1/2 applied to a certain block matrix X.
منابع مشابه
Iterative Computation of the Fréchet Derivative Of
We derive iterative methods for computing the Fréchet derivative of the map which 4 sends a full-rank matrix A to the factor U in its polar decomposition A = UH, where U has 5 orthonormal columns and H is Hermitian positive definite. The methods apply to square matrices 6 as well as rectangular matrices having more rows than columns. Our derivation relies on a novel 7 identity that relates the ...
متن کاملThe Fréchet Derivative of the Polar Decomposition
We derive iterative methods for computing the Fréchet derivative of the map which 6 sends a full-rank matrix A to the factor U in its polar decomposition A = UH, where U has 7 orthonormal columns and H is Hermitian positive definite. The methods apply to square matrices 8 as well as rectangular matrices having more rows than columns. Our derivation relies on a novel 9 identity that relates the ...
متن کاملComputing the Fréchet Derivative of the Polar Decomposition∗
We derive iterative methods for computing the Fréchet derivative of the map which sends a full-rank matrix A to the factor U in its polar decomposition A = UH, where U has orthonormal columns and H is Hermitian positive definite. The methods apply to square matrices as well as rectangular matrices having more rows than columns. Our derivation relies on a novel identity that relates the Fréchet ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 38 شماره
صفحات -
تاریخ انتشار 2017